Maximal pattern complexity, dual system and pattern recognition

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal pattern complexity, dual system and pattern recognition

For a family Ω of sets in R and a finite subset S of R, let pΩ(S) be the number of distinct sets of the form S ∩ ω for all ω ∈ Ω. The maximum pattern complexity pΩ(k) is the maximum of pΩ(S) among S with #S = k. The S attaining the maximum is considered as the most effective sampling to distinguish the sets in Ω. We obtain the exact values or at least the order of pΩ(k) in k for various classes...

متن کامل

Maximal pattern complexity of two-dimensional words

The maximal pattern complexity of one-dimensional words has been studied in several papers [T. Kamae, L. Zamboni, Sequence entropy and the maximal pattern complexity of infinite words, Ergodic Theory Dynam. Systems 22(4) (2002) 1191–1199; T. Kamae, L. Zamboni,Maximal pattern complexity for discrete systems, Ergodic Theory Dynam. Systems 22(4) (2002) 1201–1214; T. Kamae, H. Rao, Pattern Complexi...

متن کامل

Low maximal pattern complexity of infinite permutations

An infinite permutation α is a linear ordering of N. We study properties of infinite permutations analogous to those of infinite words and showing some resemblance and some difference between permutations and words. In this paper, we define maximal pattern complexity pα(n) for infinite permutations and show that this complexity function is ultimately constant if and only if the permutation is u...

متن کامل

Maximal pattern complexity for discrete systems

For an infinite word α = α0α1α2 · · · over a finite alphabet, Kamae introduced a new notion of complexity called maximal pattern complexity defined by pα(k) := sup τ ]{αn+τ(0)αn+τ(1) · · ·αn+τ(k−1); n = 0, 1, 2, · · · } where the supremum is taken over all sequences of integers 0 = τ(0) < τ(1) < · · · < τ(k − 1) of length k. Kamae proved that α is aperiodic if and only if pα(k) ≥ 2k for every k...

متن کامل

Oracle Complexity and Nontransitivity in Pattern Recognition

Different mathematical models of recognition processes are known. In present paper we consider a recognizing algorithm as an oracle computation on Turing machine [Rogers]. Such point of view seems to be useful in pattern recognition as well as in recursion theory. Use of recursion theory in pattern recognition shows connection between a recognition algorithm comparison problem and complexity pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2012

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2012.06.033